Computation of orthonormal factors for fundamental solution matrices
نویسندگان
چکیده
In this work, we introduce and analyze two new techniques for obtaining the Q factor in the QR factorization of some (or all) columns of a fundamental solution matrix Y of a linear diierential system. These techniques are based on elementary Householder and Givens transformations. We implement and compare these new techniques with existing approaches on some examples.
منابع مشابه
A numerical study of electrohydrodynamic flow analysis in a circular cylindrical conduit using orthonormal Bernstein polynomials
In this work, the nonlinear boundary value problem in electrohydrodynamics flow of a fluid in an ion-drag configuration in a circular cylindrical conduit is studied numerically. An effective collocation method, which is based on orthonormal Bernstein polynomials is employed to simulate the solution of this model. Some properties of orthonormal Bernstein polynomials are introduced and utilized t...
متن کاملWave propagation theory in offshore applications
A frequency-wavenumber-domain formulation is presented in this paper for calculation of the Green's functions and wave propagation modes in a stratified fluid body underlain by a layered viscoelastic soil medium. The Green's functions define the solid and fluid displacements and fluid pressures due to uniform disk loads acting in either the soil or fluid media. The solution is in the frequency ...
متن کاملClosed-form solution of absolute orientation using orthonormal matrices
Finding the relationship between two coordinate systems using pairs of measurements of the coordinates of a number of points in both systems is a classic photogrammetric task. It finds applications in stereophotogrammetry and in robotics. We present here a closed-form solution to the least-squares problem for three or more points. Currently, various empirical, graphical and numerical iterative ...
متن کاملClosed - Form Solution of Absolute Orientation Using
Finding the relationship between two coordinate systems using pairs of measurements of the coordinates of a number of points in both systems is a classic photogrammetric task. It finds applications in stereophotogrammetry and in robotics. We present here a closed-form solution to the least-squares problem for three or more points. Currently, various empirical, graphical and numerical iterative ...
متن کاملPreconditioned Galerkin and minimal residual methods for solving Sylvester equations
This paper presents preconditioned Galerkin and minimal residual algorithms for the solution of Sylvester equations AX XB = C. Given two good preconditioner matricesM and N for matrices A and B, respectively, we solve the Sylvester equations MAXN MXBN =MCN. The algorithms use the Arnoldi process to generate orthonormal bases of certain Krylov subspaces and simultaneously reduce the order of Syl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Numerische Mathematik
دوره 83 شماره
صفحات -
تاریخ انتشار 1999